Out-of-core visualization using iterator-aware multidimensional prefetching

نویسندگان

  • Philip J. Rhodes
  • Xuan Tang
  • R. Daniel Bergeron
  • Ted M. Sparr
چکیده

Visualization of multidimensional data presents special challenges for the design of efficient out-of-core data access. Elements that are nearby in the visualization may not be nearby in the underlying data file, which can severely tax the operating system’s disk cache. The Granite Scientific Database System can address these problems because it is aware of the organization of the data on disk, and it knows the visualization method’s pattern of access. The access pattern is expressed using a toolkit of iterators that both describe the access pattern and perform the iteration itself. Because our system has knowledge of both the data organization and the access pattern, we are able to provide significant performance improvements while hiding the details of out-of-core access from the visualization programmer. This paper presents a brief description of our disk access system placing special emphasis on the benefits offered to a visualization application. We describe a simple demonstration application that shows dramatic performance improvements when used with the 39GB Visible Woman Dataset. CR Categories: E.5 [Files]—I.3.6 [Computer Graphics]: Methodology and Techniques—Graphics Data Structures and Data Types I.3.m[Computer Graphics]: Miscellaneous—Scientific Visualization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial prefetching for out-of-core visualization of multidimensional data

In this paper we propose a technique called storage-aware spatial prefetching that can provide significant performance improvements for out-of-core visualization. This approach is motivated by file chunking in which a multidimensional data file is reorganized into multidimensional sub-blocks that are stored linearly in the file. This increases the likelihood that data close in the n-dimensional...

متن کامل

HPX Data Prefetching Iterator

Prefetching Iterator Implemented in HPX •for_each is one of the HPX parallel algorithms used to evaluate the proposed prefetching method. •Data of the next iteration step is prefetched in the cache memory with the prefetching iterator called in each iteration within the for_each . •HPX combines prefetching method with the asynchronous task execution by providing a new future instance representi...

متن کامل

Knowledge-Based Out-of-Core Algorithms for Data Management in Visualization

Data management is the very first issue in handling very large datasets. Many existing out-of-core algorithms used in visualization are closely coupled with application-specific logic. This paper presents two knowledgebased out-of-core prefetching algorithms that do not use hard-coded rendering-related logic. They acquire the knowledge of the access history and patterns dynamically, and adapt t...

متن کامل

Iteration Aware Prefetching for Large Multidimensional Scientific Datasets

Most caching and prefetching research does not take advantage of prior knowledge of access patterns, or does not adequately address the storage issues inherent with multidimensional scientific data. Armed with an access pattern specified as an iteration over a multidimensional array stored in a disk file, we use prefetching to greatly reduce the number of disk accesses and partially hide the co...

متن کامل

A Fast Multithreaded Out-of-Core Visualization Technique

Out–of–core rendering techniques are necessary for viewing large volume disk–resident data sets produced by many scientific applications or high resolution imaging systems. Traditional visualizers can provide real–time performance but require all of the data to be viewed to be in the RAM. We describe a multithreaded implementation of an out–of–core isosurface renderer that does not impose such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005